Modified Fast Bandwidth-Constrained Shortest Path Algorithm for MACO
نویسندگان
چکیده
منابع مشابه
Modified Fast Bandwidth-Constrained Shortest Path Algorithm for MACO
Ant Colony Optimization is a probabilistic technique for finding the optimal path for reaching a destination using graphs. This algorithm was further developed to introduce the concept of Multiple Ant Colony Optimization technique in which ants were classified into various families that worked to provide optimal path solutions to the destination for their own family. This paper aims at proposin...
متن کاملModified Dijkstra’s Shortest Path Algorithm
Roads play a vital role to the people live in different places and, from day to day, they travel to schools, to work, to shops, and to transport their goods. Even in this modern world, roads remain one of the mediums used most frequently for travel and transportation. The computation of a shortest path between different locations appears to be a key problem in the road networks. The wide range ...
متن کاملConstrained Shortest Path Computation
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequence of data points connecting s and d, such that the distance between any two consecutive points in the path is not greater than a. A k-stops query retrieves a sequence that contains exactly k intermediate data points....
متن کاملAcceleration of Shortest Path and Constrained Shortest Path Computation
We study acceleration methods for point-to-point shortest path and constrained shortest path computations in directed graphs, in particular in road and railroad networks. Our acceleration methods are allowed to use a preprocessing of the network data to create auxiliary information which is then used to speed-up shortest path queries. We focus on two methods based on Dijkstra’s algorithm for sh...
متن کاملRouting Military Aircraft with a Constrained Shortest-path Algorithm
We formulate and solve aircraft-routing problems that arise when planning missions for military aircraft that are subject to ground-based threats such as surface-to-air missiles. We use a constrained-shortest path (CSP) model that discretizes the relevant airspace into a grid of vertices representing potential waypoints, and connects vertices with directed edges to represent potential flight se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2013
ISSN: 0975-8887
DOI: 10.5120/12115-8512